A Scalable Deadlock Avoidance Policy for Batch Processes
نویسنده
چکیده
Allocating non-sharable resources for jobs in batch processes can lead to deadlocks. Using colored di-graphs to model the wait-relationship between resources in a job-path, a graph-theoretic approach is proposed to give necessary conditions for the existence of unsafe system states, i.e., allocations that will prevent some jobs from successful execution. Based on these necessary conditions a correct and scalable control policy for deadlock avoidance is given. As shown in the paper this control policy is somewhat conservative and allows some trade-o between computational complexity and permissiveness.
منابع مشابه
Deadlock Avoidance in Batch Processes
A Petri net based approach for the modeling of batch plants as well as products is presented. Allocating non-sharable resources for product recipes can lead to deadlocks. In this paper we focus on the detection of potential deadlock situations using a graph structure derived from synchronization issues that arise when moving a batch between resources. It is shown that different graph patterns d...
متن کاملDeadlock avoidance policies for automated manufacturing cells
Although the typical process-layout manufacturing environment is susceptible to deadlocks , the problem of deadlock resolution in this context has only lately been undertaken by the scientiic community. Previous studies have found that deadlock avoidance method-ologies seem to be the most appropriate for this particular context. Unfortunately, in the general case, these methods suuer from high ...
متن کاملObservations on the interactions among deadlock avoidance policies and dispatching rules in automated manufacturing systems
In automated manufacturing systems, deadlock avoidance policies guarantee deadlock-free operation while performance controllers, such as dispatching rules, attempt to achieve performance thresholds. In an automated system, dispatching rules must work within the constraints imposed by the deadlock avoidance policy in order to assure continuing system operation, and thus, the deadlock avoidance l...
متن کاملAn Optimal Deadlock Avoidance Policy for Manufacturing System with Flexible Operation Sequence and Flexible Routing
This paper addresses the deadlock avoidance problems in manufacturing systems with sequence and route flexibility. It is shown that for a large class of such systems, through one-step look ahead, an optimal deadlock avoidance policy can be obtained. For a general system the authors present a system reduction method by which the system is reduced and the reduced system has an optimal deadlock av...
متن کاملPolynomial-Complexity Deadlock Avoidance Policies for Sequential Resource Allocation Systems
The development of e cient deadlock avoidance policies (DAP's) for sequential resource allocation systems (RAS) is a problem of increasing interest in the scienti c community, largely because of its relevance to the design of large-scale exibly automated manufacturing systems. Much of the work on this problem existing in the literature, is focused on the so called Single-Unit RAS model, which i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000